The Ryōan-ji axiom for common knowledge on hypergraphs
نویسندگان
چکیده
The article studies common knowledge in communication networks with a fixed topological structure. It introduces a non-trivial principle, called the Ryōan-ji axiom, which captures logical properties of common knowledge of all protocols with a given network topology. A logical system, consisting of the Ryōan-ji axiom and two additional axioms, is proven to be sound and complete.
منابع مشابه
Axiom Dependency Hypergraphs for Fast Atomic Decomposition of Ontologies
In this paper we use directed hypergraphs to represent the locality-based dependencies between the axioms of an OWL ontology. We define a notion of an axiom dependency hypergraph, where axioms are represented as nodes and dependencies between axioms as hyperedges connecting possibly several nodes with one node. We show that a locality-based module of an ontology corresponds to a connected compo...
متن کاملOn characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملCost Efficiency Evaluation via Data Envelopment Analysis Approach for Undesirable Outputs based on the Weak Disposability Axiom (Case Study: 56 Electricity Producing Thermal Power Plants in Iran)
Cost efficiency evaluation is a very important and applicable issue in Data Envelopment Analysis (DEA). In this paper, the classical cost efficiency model in which all the input prices are known and fixed for each decision making unit is developed via undesirable outputs with the weak disposability axiom. The proposed model is a nonlinear model under the variable returns to scale condition,...
متن کاملON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملStrong Completeness Theorems for Weak Logics of Common Belief
We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Synthese
دوره 191 شماره
صفحات -
تاریخ انتشار 2014